Automorphisms of $\omega$-octahedral graphs.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphisms of trivalent graphs

Let Gg,b be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface ⌃g,b of genus g with b boundary components. We describe the set Ag,b of all automorphisms of graphs in Gg,b showing that, up to suitable moves changing the graph within Gg,b, any such automorphism can be reduced to elementary switches of adjacent edges.

متن کامل

Automorphisms of graphs

This chapter surveys automorphisms of finite graphs, concentrating on the asymmetry of typical graphs, prescribing automorphism groups (as either permutation groups or abstract groups), and special properties of vertex-transitive graphs and related classes. There are short digressions on infinite graphs and graph homomorphisms. 1 Graph automorphisms An automorphism of a graph G is a permutation...

متن کامل

Automorphisms of infinite Johnson graphs

Let I be a set of infinite cardinality α. For every cardinality β ≤ α the Johnson graphs Jβ and J are the graphs whose vertices are subsets X ⊂ I satisfying |X | = β , |I \ X | = α and |X | = α, |I \ X | = β (respectively) and vertices X, Y are adjacent if |X \ Y | = |Y \ X | = 1. Note that Jα = J and Jβ is isomorphic to J for every β < α. If β is finite then Jβ and J are connected and it is no...

متن کامل

Two-fold automorphisms of graphs

In this paper we shall present a natural generalisation of the notion of automorphism of a graph or digraph G, namely a two-fold automorphism. This is a pair (α, β) of permutations of the vertex set V(G) which acts on ordered pairs of vertices of G in the natural way. The action of (α, β) on all such ordered pairs gives a graph which is two-fold isomorphic to G. When α = β the two-fold automorp...

متن کامل

Symplectic graphs and their automorphisms

The general symplectic graph Sp(2ν, q) is introduced. It is shown that Sp(2ν, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphisms are also determined.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1982

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093870154